#include <stdio.h>
#include <stdlib.h>

#define ERROR NULL
typedef enum {false, true} bool;
typedef int ElementType;
typedef struct LNode *PtrToLNode;
struct LNode {
    ElementType Data;
    PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;

List MakeEmpty(); 
Position Find( List L, ElementType X );
bool Insert( List L, ElementType X, Position P );
bool Delete( List L, Position P );

int main()
{
    List L = NULL;
    ElementType X = 0;
    Position P = NULL;
    int N = 0;
    bool flag = false;

    L = MakeEmpty();
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &X);
        flag = Insert(L, X, L->Next);
        if ( flag==false ) printf("Wrong Answer\n");
    }
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &X);
        P = Find(L, X);
        if ( P == ERROR )
            printf("Finding Error: %d is not in.\n", X);
        else 
        {
            flag = Delete(L, P);
            printf("%d is found and deleted.\n", X);
            if ( flag==false )
                printf("Wrong Answer.\n");
        }
    }
    flag = Insert(L, X, NULL);
    if ( flag==false ) printf("Wrong Answer\n");
    else
        printf("%d is inserted as the last element.\n", X);
    P = (Position)malloc(sizeof(struct LNode));
    flag = Insert(L, X, P);
    if ( flag==true ) printf("Wrong Answer\n");
    flag = Delete(L, P);
    if ( flag==true ) printf("Wrong Answer\n");
    for ( P=L->Next; P; P = P->Next ) printf("%d ", P->Data);
    return 0;
}
/* 你的代码将被嵌在这里 */

List MakeEmpty()
{
    List p;
    p = (List)malloc(sizeof(struct LNode));
    p->Data = 0;
    p->Next = NULL;
    return p;
}
bool Insert( List L, ElementType X, Position P )
{
    List p = L;
    if(p!=NULL&&p->Next != P)
        p = p->Next;
    if(!p)
    {
        printf("Wrong Position for insertion");
        return false;
    }
    List temp = (List)malloc(sizeof(struct LNode)); 
    temp->Data = X;
    temp->Next = P;
    p->Next = temp;

    return true;
}
Position Find( List L, ElementType X )
{
    Position p = L;
    if(p&&p->Data != X)
        p = p->Next;
    if(!p)
        return ERROR;
    return p;
}
bool Delete( List L, Position P )
{
    Position p = L;
    while(p!=NULL&&p->Next != P)
    {
            p = p->Next;
    }
    if(p==NULL)
        {
            printf("Wrong Position for deletion");
            return false;
        }
    p->Next = (p->Next)->Next;
    
    return true;
}
